Boson sampling with random numbers of photons

نویسندگان

چکیده

Multiphoton interference is at the very heart of quantum foundations and applications in sensing information processing. In particular, boson sampling experiments have potential to demonstrate computational supremacy while only relying on multiphoton linear optical interferometers. However, even when photonic losses are negligible, scalable challenged by rapid decrease probability success current schemes with probabilistic sources for a large number single photons each experimental sample. Remarkably, we show novel scheme where increases instead decreasing input eventually approaching unit value non deterministic sources. This achieved same time occupied ports per port, differently form previous fixed run. Therefore, these results provide new exciting route toward future demonstrations resources.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational imaging with small numbers of photons

The ability of an active imaging system to accurately reconstruct scene properties in low light-level conditions has wide-ranging applications, spanning biological imaging of delicate samples to long-range remote sensing. Conventionally, even with timeresolved detectors that are sensitive to individual photons, obtaining accurate images requires hundreds of photon detections at each pixel to mi...

متن کامل

Higgs-boson decay into photons

We compute the dominant two-loop electroweak correction, of O(GFM t ), to the partial width of the decay of an intermediate-mass Higgs boson into a pair of photons. We use the asymptotic-expansion technique in order to extract the leading dependence on the top-quark mass plus four expansion terms that describe the dependence on the W and Higgs-boson masses. This correction reduces the Born resu...

متن کامل

Laws of Large Numbers for Random Linear

The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...

متن کامل

Wiener numbers of random pentagonal chains

The Wiener index is the sum of distances between all pairs of vertices in a connected graph. In this paper, explicit expressions for the expected value of the Wiener index of three types of random pentagonal chains (cf. Figure 1) are obtained.

متن کامل

Random Sampling in Computational Algebra: Helly Numbers and Violator Spaces

This paper transfers a randomized algorithm, originally used in geometric optimization, to computational problems in commutative algebra. We show that Clarkson's sampling algorithm can be applied to two problems in computational algebra: solving large-scale polynomial systems and finding small generating sets of graded ideals. The cornerstone of our work is showing that the theory of violator s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2021

ISSN: ['1538-4446', '1050-2947', '1094-1622']

DOI: https://doi.org/10.1103/physreva.104.032204